Perfect graphs are kernel solvable
نویسندگان
چکیده
In this paper we prove that perfect graphs are kernel solvable, as it was conjectured by Berge and Duchet (1983). The converse statement, i.e. that kernel solvable graphs are perfect, was also conjectured in the same paper, and is still open. In this direction we prove that it is always possible to substitute some of the vertices of a non-perfect graph by cliques so that the resulting graph is not kernel solvable.
منابع مشابه
Parity graphs are kernel-M-solvable
While the famous Berge’s Strong Perfect Graph Conjecture (see [l] for details on perfect graphs) remains a major unsolved problem in Graph Theory, an alternative characterization of Perfect Graphs was conjectured in 1982 by Berge and the author [3]. This second conjecture asserts the existence of kernels for a certain type of orientations of perfect graphs. Here we prove a weaker form of the co...
متن کاملPerfect graphs, kernels, and cores of cooperative games
A kernel of a directed graph D is defined as an independent set which is reachable from each outside vertex by an arc. A graph G is called kernel-solvable if an orientation D of G has a kernel whenever each clique of G has a kernel in D. The notion of kernel-solvability has important applications in combinatorics, list coloring, and game theory. It turns out that kernel-solvability is equivalen...
متن کاملDesigning Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملParameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs
For fixed integers r, l ≥ 0, a graph G is called an (r, l)-graph if the vertex set V (G) can be partitioned into r independent sets and l cliques. Such a graph is also said to have cochromatic number r + l. The class of (r, l) graphs generalizes r-colourable graphs (when l = 0) and hence not surprisingly, determining whether a given graph is an (r, l)-graph is NP-hard even when r ≥ 3 or l ≥ 3 i...
متن کاملParameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs
For fixed integers r, ` ≥ 0, a graph G is called an (r, `)-graph if the vertex set V (G) can be partitioned into r independent sets and ` cliques. Such a graph is also said to have cochromatic number r + `. The class of (r, `) graphs generalizes r-colourable graphs (when ` = 0) and hence not surprisingly, determining whether a given graph is an (r, `)-graph is NP-hard even when r ≥ 3 or ` ≥ 3 i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 159 شماره
صفحات -
تاریخ انتشار 1996